Notes on Mader ’ s S - Paths Theorem ASP
ثبت نشده
چکیده
منابع مشابه
Is each Mader matroid a gammoid?
A Mader matroid is obtained as follows. Let G = (V,E) be an undirected graph and let S1, . . . , Sk be disjoint subsets of V . Define S := S1 ∪ · · · ∪ Sk. Let I be the collection of all subsets I of S with the property that there exist disjoint paths P1, . . . , Pt such that each Pj has its ends in different sets Si and has no internal vertices in S and such that I is a subset of the set of en...
متن کاملCollective Tree Spanners for Unit Disk Graphs with Applications
In this paper, we establish a novel balanced separator theorem for Unit Disk Graphs (UDGs), which mimics the well-known Lipton and Tarjan’s planar balanced shortest paths separator theorem. We prove that, in any n-vertex UDG G, one can find two hop-shortest paths P (s, x) and P (s, y) such that the removal of the 3-hopneighborhood of these paths (i.e., N G[P (s, x)∪P (s, y)]) from G leaves no c...
متن کاملThe graphs with the max-Mader-flow-min-multiway-cut property
We are given a graph G, an independant set S ⊂ V (G) of terminals, and a function w : V (G) → N. We want to know if the maximum w-packing of vertex-disjoint paths with extremities in S is equal to the minimum weight of a vertex-cut separating S. We call Mader-Mengerian the graphs with this property for each independant set S and each weight function w. We give a characterization of these graphs...
متن کاملOn s-t paths and trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding monochromatic and properly edge-colored s-t paths/trails on edge-colored graphs. Given a c-edge-colored graph Gc without properly edge-colored closed trails, we present a polynomial time procedure for the determination of properly edgecolored s-t trails visiting all vertices of Gc a prescribed number of tim...
متن کاملOn packing spanning arborescences with matroid constraint
Let D = (V + s,A) be a digraph with a designated root vertex s. Edmonds’ seminal result [4] implies that D has a packing of k spanning s-arborescences if and only if D has a packing of k (s, t)-paths for all t ∈ V , where a packing means arc-disjoint subgraphs. Let M be a matroid on the set of arcs leaving s. A packing of (s, t)-paths is called M-based if their arcs leaving s form a base of M w...
متن کامل